A hybrid scheme for prime factorization and its experimental implementation using IBM quantum processor
نویسندگان
چکیده
We report a quantum–classical hybrid scheme for factorization of bi-prime numbers (which are odd and square-free) using IBM’s quantum processors. The proposed here involves both classical optimization techniques adiabatic techniques, is build by extending previous [Pal et al., Pramana 92, 26 (2019) Xu Phys. Rev. Lett. 108, 130501 (2012)]. part the very general in sense that it can be implemented any computing architecture. Here, as an example, we experimentally implement our prime QX4 processor have factorized 35.
منابع مشابه
Quantum adiabatic algorithm for factorization and its experimental implementation.
We propose an adiabatic quantum algorithm capable of factorizing numbers, using fewer qubits than Shor's algorithm. We implement the algorithm in a NMR quantum information processor and experimentally factorize the number 21. In the range that our classical computer could simulate, the quantum adiabatic algorithm works well, providing evidence that the running time of this algorithm scales poly...
متن کاملPrime Factorization on a Quantum Computer
complete problems eeciently is a Holy Grail of theoretical computer science which very few people expect to be possible on a classical computer. Finding polynomial-time algorithms for solving these problems on a quantum computer would be a momentous discovery. There are some weak indications that quantum computers are not powerful enough to solve NP-complete problems Bennett et al. 1996a], but ...
متن کاملErratum: Prime factorization using quantum annealing and computational algebraic geometry
We investigate prime factorization from two perspectives: quantum annealing and computational algebraic geometry, specifically Gröbner bases. We present a novel autonomous algorithm which combines the two approaches and leads to the factorization of all bi-primes up to just over 200000, the largest number factored to date using a quantum processor. We also explain how Gröbner bases can be used ...
متن کاملA Note on Shor's Quantum Algorithm for Prime Factorization
It’s well known that Shor[1] proposed a polynomial time algorithm for prime factorization by using quantum computers. For a given number n, he gave an algorithm for finding the order r of an element x (mod n) instead of giving an algorithm for factoring n directly. The indirect algorithm is feasible because factorization can be reduced to finding the order of an element by using randomization[2...
متن کاملComputing prime factors with a Josephson phase qubit quantum processor
A quantum processor (QuP) can be used to exploit quantum mechanics to find the prime factors of composite numbers[1]. Compiled versions of Shor’s algorithm have been demonstrated on ensemble quantum systems[2] and photonic systems[3–5], however this has yet to be shown using solid state quantum bits (qubits). Two advantages of superconducting qubit architectures are the use of conventional micr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2021
ISSN: ['1573-1332', '1570-0755']
DOI: https://doi.org/10.1007/s11128-021-03053-9